Backjump-based backtracking for constraint satisfaction problems
نویسندگان
چکیده
منابع مشابه
A Theoretical Evaluation of Selected Backtracking Algorithms
In recent years, many new backtracking algorithms for solving constraint satisfaction problems have been proposed. The algorithms are usually evaluated by empirical testing. This method, however, has its limitations. Our paper adopts a different, purely theoretical approach, which is based on characterizations of the sets of search tree nodes visited by the backtracking algorithms. A notion of ...
متن کاملRetroactive Ordering for Dynamic Backtracking
Dynamic Backtracking (DBT ) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT , variables are allowed to keep their assignment during backjump, if they are compatible with the set of eliminating explanations. A previous study has shown that when DBT is combined with variable ordering heuristics it performs poorly compared to standard Conflictdirected Backjumping (CB...
متن کاملConstraint Sovling Engine based Nurse rostering with Intelligent Backtracking
Efficient utilization of time and effort is essential in Personnel scheduling problems to evenly balance the workload among the people and attempt to satisfy the personnel preferences. In Constraint Satisfaction Problem based scheduling problems, when a branch of the search fails the backtracking search algorithm back up to the preceding variable and try a different value for it. So here the mo...
متن کاملMAC-DBT Revisited
Dynamic Backtracking (DBT ) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT , variables are allowed to keep their assignment during backjump, if they are compatible with the set of eliminating explanations. A previous study has shown that when DBT is combined with variable ordering heuristics, it performs poorly compared to standard Conflict-directed Backjumping (...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 136 شماره
صفحات -
تاریخ انتشار 2002